diameter Partitioning

We discuss the problem of partitioning a set of points into two subsets with certain conditions on the diameters of the subsets and on their cardinalities. For example, we give an O(n log n) algorithm to find the smallest t such that the set can be split into two equal cardinality subsets each of which has diameter at most t. We also give an algorithm that takes two pairs of points (x, y) and (s, t) and decides whether the set can be partitioned into two subsets with the respective pairs of points as diameters.